منابع مشابه
Model Checking on Product Structures
We present an algorithm for checking CTL formulas in Kripke structures with side conditions, where the side conditions define new variables in terms of path formulas. Given any CTL formula where the defined variables may occur, the presented algorithm will determine the set of states where the CTL∗ formula holds that is obtained by replacing each new variable defined by a side condition by its ...
متن کاملOn Model Checking Durational Kripke Structures
We consider quantitative model checking in durational Kripke structures (Kripke structures where transitions have integer durations) with timed temporal logics where subscripts put quantitative constraints on the time it takes before a property is satisfied. We investigate the conditions that allow polynomial-time model checking algorithms for timed versions of CTL and exhibit an important gap ...
متن کاملModel Checking Partially Ordered State Spaces
The state explosion problem is the fundamental limitation of veriication through model checking. In many cases, representing the state space of a system as a lattice is an eeective way of ameliorating this problem. The partial order of the state space lattice represents an information ordering. The paper shows why using a lattice structure is desirable, and why a quaternary temporal logic rathe...
متن کاملModel-Checking of Ordered Multi-Pushdown Automata
We address the verification problem of ordered multi-pushdown automata: A multi-stack extension of pushdown automata that comes with a constraint on stack transitions such that a pop can only be performed on the first non-empty stack. First, we show that the emptiness problem for ordered multi-pushdown automata is in 2ETIME. Then, we prove that, for an ordered multi-pushdown automata, the set o...
متن کاملOn Minimal Ordered Structures
We partially describe minimal, first-order structures which have a strong form of the strict order property. An infinite first-order structure is minimal if its each definable (possibly with parameters) subset is either finite or co-finite. It is strongly minimal if the minimality is preserved in elementarily equivalent structures. While strongly minimal structures were investigated more closel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2020
ISSN: 1529-3785,1557-945X
DOI: 10.1145/3360011